353D - Queue - CodeForces Solution


constructive algorithms dp *2000

Please click on ads to support us..

Python Code:

seq = input()
seq = seq[seq.find('M'):]

n_girls = seq.count('F')
last_girl = seq.rfind('F')

i = last_girl - 1
delay = 0
delta = 1
chk = 'M'
max_delay = 0
while i > 0:
    if seq[i] == chk:
        delta *= -1
        chk = 'F' if chk == 'M' else 'M'
        continue
    i -= 1
    delay += delta
        if delay > max_delay:
        max_delay = delay

print(last_girl - n_girls + 1 + max_delay)


Comments

Submit
0 Comments
More Questions

1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math